Home > Search Results: keywords:"Vehicle Routing Problem with Time Windows"
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 3 records found  Search took 0.01 seconds. 
Analysis of the company´s expenses associated with relocation of the distribution center
 Petrovičová, Andrea ; Pelikán, Jan (advisor) ; Fábry, Jan (referee)
The objective of the thesis is to analyze the company´s expenses associated with relocation of the distribution centre as well as to describe the components of expenses associated with transport between company and customers. An important part of the thesis is comparison of the individual delivery routes. The theoretical part provides a brief description of Vehicle Routing Problem and its modifications as well as the different options how to solve it. The expenses calculations of truck transport are approximated to the reader. The practical part shows the real problem of Nestlé. The decreasing of the expenses is shown on real data. The reason of decreasing is the relocation of the distribution centre. The model routes are compared with the actual ones using MPL. It also shows the potential cost reduction.
Detailed record
Implementation of Heuristics for Vehicle Routing Problem with Time Windows
 Trunda, Otakar ; Pelikán, Jan (advisor) ; Holý, Vladimír (referee)
Vehicle Routing Problem with Time Windows is a hard optimization problem. Even though it has numerous practical applications, the question of solving it efficiently has not been satisfyingly solved yet. This thesis studies the Vehicle Routing Problem with Time Windows and presents several new algorithms for solving it. There are two heuristics presented here, as well as several more complex algorithms which use those heuristics as their components. The efficiency of presented techniques is evaluated experimentally using a set of test samples. As a part of this thesis, I have also developed a desktop application which implements presented algorithms and provides a few additional features useful for solving routing prob-lems in practice. Among others, there is a generator of pseudo-random problem instances and several visualization methods.
Detailed record
Optimizing Parcel’s Delivery of Czech Post
 Svojšová, Kateřina ; Skočdopolová, Veronika (advisor) ; Borovička, Adam (referee)
The aim of my bachelor's thesis is to optimize the parcel's delivery of the Czech post in the surroundings of Kolín and Kutná Hora, which is operated by Depo Kolín 70. This service's speciality is that the parcels are being delivered to individual post offices according to the zip code. The main task is to minimize costs of delivery on these parcels, the next thing is to settle the optimal count of cycles assuming that delivery car has to come back to the Depo and another thing is to consider an opening time of post offices. Discrete models are used to solve this problem, specifically vehicle routing problem with time windows. To solve this model has been used LINGO optimizing software.
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English